General and Nested Wiberg Minimization: L 2 and Maximum Likelihood

نویسنده

  • Dennis Strelow
چکیده

Wiberg matrix factorization breaks a matrix Y into low-rank factors U and V by solving for V in closed form given U , linearizing V (U) about U , and iteratively minimizing ||Y − UV (U)||2 with respect to U only. This approach factors the matrix while effectively removing V from the minimization. We generalize the Wiberg approach beyond factorization to minimize an arbitrary function that is nonlinear in each of two sets of variables. In this paper we focus on the case of L2 minimization and maximum likelihood estimation (MLE), presenting an L2 Wiberg bundle adjustment algorithm and a Wiberg MLE algorithm for Poisson matrix factorization. We also show that one Wiberg minimization can be nested inside another, effectively removing two of three sets of variables from a minimization. We demonstrate this idea with a nested Wiberg algorithm for L2 projective bundle adjustment, solving for camera matrices, points, and projective depths.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Molecular Phylogeny of the Genus Lathyrus (Fabaceae-Fabeae) Based on cpDNA matK Sequence in Iran

Background: More than 60 species of the genus Lathyrus are distributed in Southwest Asia. It is the second largest genus of the tribe Fabeae, after Vicia, in the region (and in Iran with 23 species). In the regional Flora (Flora of Turkey, FloraIranicaand flora...

متن کامل

Rank Reduction and Volume Minimization Algorithm for State-Space Subspace System Identification

In this paper we consider the reduced rank regression problem min rank ¯ L=n,L 3 det Y α − ¯ LP β − L 3 U α Y α − ¯ LP β − L 3 U α T solved by maximum-likelihood-inspired State-Space Subspace System Identification algorithms. We conclude that the determinant criterion is, due to potential rank-deficiencies, not general enough to handle all problem instances. The main part of the paper analyzes ...

متن کامل

Robustness-based portfolio optimization under epistemic uncertainty

In this paper, we propose formulations and algorithms for robust portfolio optimization under both aleatory uncertainty (i.e., natural variability) and epistemic uncertainty (i.e., imprecise probabilistic information) arising from interval data. Epistemic uncertainty is represented using two approaches: (1) moment bounding approach and (2) likelihood-based approach. This paper first proposes a ...

متن کامل

Comparison of Artificial Neural Network, Decision Tree and Bayesian Network Models in Regional Flood Frequency Analysis using L-moments and Maximum Likelihood Methods in Karkheh and Karun Watersheds

Proper flood discharge forecasting is significant for the design of hydraulic structures, reducing the risk of failure, and minimizing downstream environmental damage. The objective of this study was to investigate the application of machine learning methods in Regional Flood Frequency Analysis (RFFA). To achieve this goal, 18 physiographic, climatic, lithological, and land use parameters were ...

متن کامل

Alternating Minimization as Sequential Unconstrained Minimization: A Survey

Sequential unconstrained minimization is a general iterative method for minimizing a function over a given set. At each step of the iteration we minimize the sum of the objective function and an auxiliary function. The aim is to select the auxiliary functions so that, at least, we get convergence in function value to the constrained minimum. The SUMMA is a broad class of these methods for which...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012